DISK SCHEDULING

Experiment Number 1 : First Come First Serve

Algorithm

• Step 1: Let Request array represent an array storing indexes of tracks that have been requested in ascending order of their time of arrival. ‘Head’ is the position of disk head.

• Step 2: Let us one by one take the tracks in default order and calculate the absolute distance of the track from the head.

• Step 3: Increment the total seek count with this distance.

• Step 4: Currently serviced track position now becomes the new head position.

• Step 5: Go to step 2 until all tracks in request array have not been serviced.